|
| |
|
|
Quality measurement of analog and digital terrestrial television broadcasting
Zach, Ondřej ; Polák, Ladislav (referee) ; Slanina, Martin (advisor)
This bachelor‘s thesis deals with the description of basic features of the analog and digital television broadcasting and suggestion of a method for objective video quality evaluation at both broadcasting types. The base of this thesis is description of picture broadcast technology in analog and digital form. Also principles of some video quality evaluation metrics are described. In this thesis, a method for video quality comparison is suggested, including a verifying of this method. According to this method, sequences at changing broadcasting conditions were recorded for both broadcasting types. The quality factors of these sequences were computed and on the basis of these factors, the analog and digital TV broadcasting were compared.
|
|
|
BSC Method and Possibilities of Its Application in IT Domain
Navrátilová, Kateřina ; Zámečníková, Eva (referee) ; Květoňová, Šárka (advisor)
Bachelor's Thesis deals with utilization of Balanced Scorecard method. The method measures a performance of an organization using financial and nonfinancial measures, which are substantial for increasing performance and efficiency. The thesis contains summary of methods used for evaluation of efficiency of information systems. A description of Balanced Scorecard is included in association with specification and description of application's implementation. The application is used for creating and administrating the strategies of Balanced Scorecard method.
|
|
|
Dynamic Metric in OSPF Networks
Mácha, Tomáš ; Orgoň, Miloš (referee) ; Bešťák, Robert (referee) ; Novotný, Vít (advisor)
Masivní vývoj Internetu vedl ke zvýšeným požadavkům na spolehlivou síťovou infrastrukturu. Efektivita komunikace v síti závisí na schopnosti směrovačů určit nejlepší cestu pro odesílání a přeposílání paketů ke koncovému zařízení. Jelikož OSPF v současné době představuje jeden z nejpoužívanějších směrovacích protokolů, jakýkoli přínos, který by pomohl udržet krok s rychle se měnícím prostředí Internetu, je velmi vítán. Významným omezením OSPF protokolu je, mimo jiné, absence informovanosti algoritmu pro výpočet metriky o aktuálním vytížení linky. Tato vlastnost představuje tzv. slabé místo, což má negativní vliv na výkonnost sítě. Z tohoto důvodu byla navržena nová metoda založená na dynamické adaptaci měnících se síťových podmínek a alternativní strategii OSPF metrik. Navržená metoda řeší problém neinformovanosti OSPF metriky o síťovém provozu a nevhodně vytížených linek, které snižují výkonnost sítě. Práce rovněž přináší praktickou realizaci, kdy vlastnosti nové metody jsou testovány a ověřeny spuštěním testů algoritmu v reálných zařízeních.
|
|
|
Sophisticated methods for electronic text checking
Flégl, Jan ; Malý, Jan (referee) ; Pfeifer, Václav (advisor)
The work is about plagiarism of source codes and text documents. We’d like to describe common known methods, learn something about commercial programs and make our own plagiarism detection software. At the beginning of introduction to the theoretical part we will define the plagiarism. We will also learn something about the history of plagiarsm and its situation in the Czech Republic. We will find out something about syntactic analysis, tools we can use to detect plagiarisms and how to discover it. We will see the function of the metrics on easy exercises. We will clear up the function of graphic method with line comparing. We will define advantages and disadvantages of all methods. At the end of the theoretical part we will find out something about commercial programs. In practical part we will make our own program which compares two source codes by using statistical access methods. We will check its function and ability to detect plagiarism by corpus of source codes which we will create.
|
|
|
IP traffic performance
Bednář, František ; Martinásek, Zdeněk (referee) ; Mácha, Tomáš (advisor)
The master thesis „IP traffic performance“ is focused on traffic testing in IP networks. Theoretical section explains routing issue in an autonomous system. This work contains a detailed description of OSPF protocol. This work also deals with behavior of a link failure. There are described mechanisms that are used to link failure detection and subsequent traffic rerouting. The next section describes mechanisms to ensure quality of service. In master thesis are explained InterServ and DiffServ mechanisms. A large part is devoted to DiffServ mechanism that ensures distinction of data flows and classification packets into different classes. The routers than can process the individual data streams with different priorities. The practical section includes the design of experimental network and creation of simulation in Opnet Modeler. By using several scenarios are compared the characteristics of routing protocols and impact of QoS on the transmission characteristics of the network. Part of practical section is the improvement of OSPF protocol by adding a new metric and implementing a new metric in software suite Quagga.
|
|
|
Search of Metric State Space with Obstacles
Lukáč, Jakub ; Rozman, Jaroslav (referee) ; Šůstek, Martin (advisor)
This thesis is focused on search of metric state space with obstacles. The thesis selects four methods based on state space search and presents two new algorithms, which will try to consider an obstacles in metric space. The selected methods and the new designed algorithms are implemented as an application in programming language Java, application is also part of the thesis. The thesis presents experiments on metric spaces with various kind of obstacles for comparison of individual methods.
|
|
|
Plagiarism detection of program codes
Nečadová, Anežka ; Smital, Lukáš (referee) ; Vítek, Martin (advisor)
This semestral thesis presents definition of plagiarism and focuses primarily on solving this problem in academic world. The main topic is the detection of plagiarism. It is discussed the various steps of the detection process and special attention is given to plagiarism detection of program codes. The work mentions question of the reliability of detection tools and divides the plagiarism detection methods into basic groups. One chapter is devoted metrics for comparing files. Mentioned are two tools available to detect plagiarism. In the last chapter is analyzed own draft program for plagiarism detection of program codes. The detector was applied to a database of student’s works, and the results were plotted.
|
|
|
Taxicab Metric in Teaching-Learning Process at Basic School
Bruna, Jiří ; Zhouf, Jaroslav (advisor) ; Vondrová, Naďa (referee)
This master's thesis explores the possibility of including Taxicab metric as a subject matter into instruction at lower secondary level of education and it does so in several ways. Firstly, it looks into a curricular document of state level (Framework Educational Programme) and discusses instances at which the subject matter and the concept of lower secondary education are in agreement. Secondly, this thesis analyses a selected series of textbooks with respect to exercises that can be seen as linked to non-Euclidean metrics. Furthermore an experiment is described and evaluated, whose purpose, as a part of this thesis, was to find out if selected pupils can successfully solve problems in the context of the Taxicab metric and if related instruction influenced pupils' understanding of the concept of line segment and circle in a desired way. The teaching material which constituted an integral part of the experiment is presented as well.
|
|
|
Computational Intelligence Methods in Metalearning
Šmíd, Jakub ; Neruda, Roman (advisor) ; Vanschoren, Joaquin (referee) ; Vomlelová, Marta (referee)
This thesis focuses on the algorithm selection problem, in which the goal is to recommend machine learning algorithms to a new dataset. The idea behind solving this issue is that algorithm performs similarly on similar datasets. The usual approach is to base the similarity measure on the fixed vector of metafeatures extracted out of each dataset. However, as the number of attributes among datasets varies, we may be loosing important information. Herein, we propose a family of algorithms able to handle even the non-propositional representations of datasets. Our methods use the idea of attribute assignment that builds the distance measure between datasets as a sum of distance given by the optimal assignment and an attribute distance measure. Furthermore, we prove that under certain conditions, we can guarantee the resulting dataset distance to be a metric. We carry out a series of metalearning experiments on the data extracted from the OpenML repository. We build up attribute distance using Genetic Algorithms, Genetic Programming and several regularization techniques such as multi-objectivization, coevolution, and bootstrapping. The experiment indicates that the resulting dataset distance can be successfully applied on the algorithm selection problem. Although we use the proposed distance measures exclusively...
|
guest ::
